Running Modulus Recursions
نویسندگان
چکیده
Fix integers b ≥ 2 and k ≥ 1. Define the sequence {zn} recursively by taking z0 to be any integer, and for n ≥ 1, take zn to be the least nonnegative residue of bzn−1 modulo (n + k). Since the modulus increases by 1 when stepping from one term to the next, such a definition will be called a running modulus recursion or rumor for short. While the terms of such sequences appear to bounce around irregularly, empirical evidence suggests the terms will eventually be zero. We prove this is so when one additional assumption is made, and we conjecture that this additional condition is always met.
منابع مشابه
The Period Lengths of Inversive Congruential Recursions
They used this method as a nonlinear method to generate pseudorandom numbers. Niederreiter [10] generalized it over arbitrary finite field GF(q) when he studied pseudorandom vectors. See also Eichenauer-Herrmann [5] and Niederreiter [11, Chapters 8 and 10] and [12] for more details on these methods. Because the recursion (1) is used to construct pseudorandom numbers and pseudorandom vectors, th...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملThe effect of a running task on muscle shear elastic modulus of posterior lower leg
Background Medial tibial stress syndrome (MTSS) is one of the most common causes of exercise-related leg pain in runners. Because stopping training due to pain from MTSS could decrease the athlete's competitiveness, it is necessary to construct MTSS prevention and treatment programs. However, the effect of running, which is believed to cause MTSS, on shear elastic modulus of the posterior lower...
متن کاملRSA modulus generation in the two-party case
In this paper, secure two-party protocols are provided in order to securely generate a random k-bit RSA modulus n keeping its factorization secret. We first show that most existing two-party protocols based on Boneh’s test are not correct: an RSA modulus can be output in the malicious case. Recently, Hazay et al. [13] proposed the first proven secure protocol against any polynomial active adver...
متن کاملUniform Modulus of Continuity of Random Fields
A sufficient condition for the uniform modulus of continuity of a random field X = {X(t), t ∈ RN} is provided. The result is applicable to random fields with heavy-tailed distribution such as stable random fields. Running head: Uniform Modulus of Continuity of Random Fields 2000 AMS Classification numbers: 60G60, 60G52, 60G17, 60G18.
متن کامل